Trend Filtering on Graphs
نویسندگان
چکیده
Yu-Xiang Wang1,2 [email protected] James Sharpnack3 [email protected] Alexander J. Smola1,4 [email protected] Ryan J. Tibshirani1,2 [email protected] 1 Machine Learning Department, Carnegie Mellon University, Pittsburgh, PA 15213 2 Department of Statistics, Carnegie Mellon University, Pittsburgh, PA 15213 3 Mathematics Department, University of California at San Diego, La Jolla, CA 10280 4 Marianas Labs, Pittsburgh, PA 15213
منابع مشابه
Trend Filtering: Empirical Mode Decompositions versus ℓ1 and Hodrick-Prescott
Considering the problem of extracting a trend from a time series, we propose a novel approach based on empirical mode decomposition (EMD), called EMD trend filtering. The rationale is that EMD is a completely data-driven technique, which offers the possibility of estimating a trend of arbitrary shape as a sum of low-frequency intrinsic mode functions produced by the EMD. Based on an empirical a...
متن کامل1 Trend Filtering
The problem of estimating underlying trends in time series data arises in a variety of disciplines. In this paper we propose a variation on Hodrick–Prescott (H-P) filtering, a widely used method for trend estimation. The proposed !1 trend filtering method substitutes a sum of absolute values (i.e., !1 norm) for the sum of squares used in H-P filtering to penalize variations in the estimated tre...
متن کاملl1 Trend Filtering
The problem of estimating underlying trends in time series data arises in a variety of disciplines. In this paper we propose a variation on Hodrick-Prescott (H-P) filtering, a widely used method for trend estimation. The proposed l1 trend filtering method substitutes a sum of absolute values (i.e., an l1-norm) for the sum of squares used in H-P filtering to penalize variations in the estimated ...
متن کاملParameterless Discrete Regularization on Graphs for Color Image Filtering
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered as a variational problem which consists in minimizing an appropriate energy function. In this paper, we propose a general discrete regularization framework defined on weighted graphs which can be seen as a discrete ana...
متن کاملSampling, Filtering and Sparse Approximations on Combinatorial Graphs
In this paper we address sampling and approximation of functions on combinatorial graphs. We develop filtering on graphs by using Schrodinger’s group of operators generated by combinatorial Laplace operator. Then we construct a sampling theory by proving Poincare and Plancherel-Polya-type inequalities for functions on graphs. These results lead to a theory of sparse approximations on graphs and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Machine Learning Research
دوره 17 شماره
صفحات -
تاریخ انتشار 2015